#include <bits/stdc++.h>
using namespace std;
long long n,r[100005],ans;
int book[100005];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin >> n;
    ans = n;
    for (int i = 1;i <= n;i++)
    {
        cin >> r[i];
    }
    sort(r+1,r+n+1);
    for (int i = 2;i <= n;i++)
    {
        for (int j = 1;j <= i;j++)
        {
            if (r[i] > r[j] && book[j] == 0)
            {
                ans--;
                book[j] = 1;
                break;
            }
        }
    }
    cout << ans;
    return 0;
}
